Necessary and Sufficient Conditions for Local Pareto Optimality on Time Scales
نویسنده
چکیده
We study a multiobjective variational problem on time scales. For this problem, necessary and sufficient conditions for weak local Pareto optimality are given. We also prove a necessary optimality condition for the isoperimetric problem with multiple constraints on time scales.
منابع مشابه
Pareto Optimality Conditions and Duality for Vector Quadratic Fractional Optimization Problems
One of the most important optimality conditions to aid in solving a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient optimality conditions, it is necessary to impose additional assumptions on the objective functions and on the constraint set.The present work is concerned with the co...
متن کاملNew Optimality Conditions for a Nondifferentiable Fractional Semipreinvex Programming Problem
In recent years, there has been an increasing interest in studying the develpoment of optimality conditions for nondifferentiable multiobjective programming problems. Many authors established and employed some different Kuhn and Tucker type necessary conditions or other type necessary conditions to research optimal solutions; see [1–27] and references therein. In [7], Lai and Ho used the Pareto...
متن کاملMultiobjective fractional variational calculus in terms of a combined Caputo derivative
Abstract. The study of fractional variational problems in terms of a combined fractional Caputo derivative is introduced. Necessary optimality conditions of Euler–Lagrange type for the basic, isoperimetric, and Lagrange variational problems are proved, as well as transversality and sufficient optimality conditions. This allows to obtain necessary and sufficient Pareto optimality conditions for ...
متن کاملOptimality Conditions for Multiobjective Programming with Generalized (zeta, rho, theta)-Convex Set Functions
Necessary conditions for Pareto optimality in multiobjective programming with subdifferentiable set functions are established in Theorem 12 of H. C. Lai and L. J. Ž . Lin J. Math. Anal. Appl. 132, 1988, 558]571 . In this paper, we establish some sufficient conditions under which a feasible solution of such a problem will be Pareto optimal provided that a weaker convexity requirement is satisfie...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کامل